Paradigms for Biomolecular Computation
نویسنده
چکیده
Biomolecular Computation (BMC) is computation done at the molecular scale, using biotechnology techniques. This paper discusses the underlying biotechnology that BMC may utilize, and surveys a number of distinct paradigms for doing BMC. We also identify a number of key future experimental milestones for the eld of BMC.
منابع مشابه
Change : Toward New Computing Paradigms
Molecular Computing is a novel computing paradigm recently emerged from and stimulated by a groundbreaking wet lab experimental work by Adleman in 1994. Since then, a great number of computation models have been proposed in the context of both biomolecular experiments and theoretical computer science (e.g., [2, 3, 7, 9, 10, 11, 13, 17, 19, 20]), trying to break through the so-called NP-complete...
متن کاملBiomolecular Computing Devices in Synthetic Biology
Synthetic biology and biomolecular computation are disciplines that fuse when it comes to designing and building information processing devices. In this chapter, we study several devices that are representative of this fusion. These are three gene circuits implementing logic gates, a DNA nanodevice and a biomolecular automaton. The operation of these devices is based on gene expression regulati...
متن کاملSolving Problems in Various Domains by Hybrid Models of High Performance Computations
This work presents a hybrid model of high performance computations. The model is based on membrane system (P system) where some membranes may contain quantum device that is triggered by the data entering the membrane. This model is supposed to take advantages of both biomolecular and quantum paradigms and to overcome some of their inherent limitations. The proposed approach is demonstrated thro...
متن کاملTwo paradigms for topological quantum computation
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid group representations. While at least parts of these paradigms are well-known to ...
متن کاملA symbolic computation approach to a problem involving multivariate Poisson distributions
Multivariate Poisson random variables subject to linear integer constraints arise in several application areas, such as queuing and biomolecular networks. This note shows how to compute conditional statistics in this context, by employing Wilf-Zeilberger Theory and associated algorithms. A symbolic computation package has been developed and is made freely available. A discussion of motivating b...
متن کامل